Extending Binary Byzantine Agreement to Multivalued Byzantine Agreement

The concern of this paper is a set of potentially faulty processes that engage in a distributed computation to agree on some piece of information. Each process enters the computation with an initial value. The computation returns a common result value to each correct process. If all correct processes begin the computation with identical initial values, then the result value equals the initial value. The computation is briefly characterized as follows. The computation is fully distributed and symmetric. It includes several rounds of synchronous message exchange over a completely connected, totally reliable, communications network.